An Explicit Similarity Transform between Cellular Automata and LFSR Matrices
نویسندگان
چکیده
منابع مشابه
An in-between "implicit" and "explicit" complexity: Automata
Implicit Computational Complexity (ICC) makes two aspects implicit, by manipulating programming languages rather than models of computation, and by internalizing the bounds rather than using external measure. We survey how automata theory contributed to complexity with a machinedependant with implicit bounds model.
متن کاملExploring and Exploiting Quantum-Dot Cellular Automata
The Full Adders (FAs) constitute the essential elements of digital systems, in a sense that they affect the circuit parameters of such systems. With respect to the MOSFET restrictions, its replacement by new devices and technologies is inevitable. QCA is one of the accomplishments in nanotechnology nominated as the candidate for MOSFET replacement. In this article 4 new layouts are presente...
متن کاملAn Introduction to Cellular Automata an Introduction to Cellular Automata
We give basic deenitions necessary to understand what are cellular automata, as well as to work with. Some eecient but sometimes problematic concepts as signal, simulation and universality, are pointed out. In particular, diierent notions of universality are put to light. On donne ici les d eenitions essentielles pour comprendre les automates cellulaires et les utiliser. On met en evidence cert...
متن کاملExplicit Link between Local Fractal Transform
Much researchs are currently carried out in the eld of fractal coding of images. Fractal models try to identify and represent self-similarity relationships within images through the use of spatial transformations of the signal associating shrinking, translation, isometries and scaling. These transformations can be interpreted frequentialy and are particularly suited to an interpretation in the ...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 1998
ISSN: 1071-5797
DOI: 10.1006/ffta.1998.0212